A Rational Krylov Method Based on Hermite Interpolation for Nonlinear Eigenvalue Problems

نویسندگان

  • Roel Van Beeumen
  • Karl Meerbergen
  • Wim Michiels
چکیده

This paper proposes a new rational Krylov method for solving the nonlinear eigenvalue problem (NLEP): A(λ)x = 0. The method approximates A(λ) by Hermite interpolation where the degree of the interpolating polynomial and the interpolation points are not fixed in advance. It uses a companion-type reformulation to obtain a linear generalized eigenvalue problem (GEP). To this GEP we apply a rational Krylov method that preserves the structure. The companion form grows in each iteration and the interpolation points are dynamically chosen. Each iteration requires a linear system solve with A(σ) where σ is the last interpolation point. The method is illustrated by small and large scale numerical examples. In particular, we illustrate that the method is fully dynamic and can be used as a global search method as well as a local refinement method. In the last case, we compare the method to Newton’s method and illustrate that we can achieve an even faster convergence rate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nleigs: a Class of Robust Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems∗

A new rational Krylov method for the efficient solution of nonlinear eigenvalue problems, A(λ)x = 0, is proposed. This iterative method, called fully rational Krylov method for nonlinear eigenvalue problems (abbreviated as NLEIGS), is based on linear rational interpolation and generalizes the Newton rational Krylov method proposed in [R. Van Beeumen, K. Meerbergen, and W. Michiels, SIAM J. Sci....

متن کامل

Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems

We propose a new uniform framework of Compact Rational Krylov (CORK) methods for solving large-scale nonlinear eigenvalue problems: A(λ)x = 0. For many years, linearizations are used for solving polynomial and rational eigenvalue problems. On the other hand, for the general nonlinear case, A(λ) can first be approximated by a (rational) matrix polynomial and then a convenient linearization is us...

متن کامل

The Minimum Eigenvalue of a Symmetric Positive De nite Toeplitz Matrix and Rational Hermitian Interpolation

A novel method for computing the minimal eigenvalue of a symmetric positive deenite Toeplitz matrix is presented. Similarly to the algorithm of Cybenko and Van Loan it is a combination of bisection and a root nding method. Both phases of the method are accelerated considerably by rational Hermite interpolation of the secular equation. For randomly generated test problems of dimension 800 the av...

متن کامل

Projection Methods for Nonlinear Sparse Eigenvalue Problems

This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods and the automated multi–level substructuring. We do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem.

متن کامل

Nonlinear Eigenvalue Problems: A Challenge for Modern Eigenvalue Methods

We discuss the state of the art in numerical solution methods for large scale polynomial or rational eigenvalue problems. We present the currently available solution methods such as the Jacobi-Davidson, Arnoldi or the rational Krylov method and analyze their properties. We briefly introduce a new linearization technique and demonstrate how it can be used to improve structure preservation and wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2013